Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
101	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Generalized Minimum Manhattan Network Problem (GMMN) – Scale-Diversity Aware Approximation and a Primal-Dual Algorithm Stefan Funke∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 05:15:26 Convex optimization Operations research Linear programming Mathematical optimization Approximation algorithm Computational complexity theory Optimization problem Duality Algorithm Theoretical computer science Applied mathematics Mathematics
102	A Soft Constraint of Equality: Complexity and Approximability? Emmanuel Hebrard, Barry O’Sullivan, and Igor Razgon Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland {e. Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:30 Mathematics Local consistency Constraint satisfaction Constraint optimization Mathematical optimization Static single assignment form FO Variable Parameterized complexity Constraint programming Software engineering Theoretical computer science
103	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
104	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:59 Operations research Convex optimization Linear programming Regression analysis NP-complete problems 2-satisfiability Dynamic programming Mathematics Mathematical optimization Theoretical computer science
105	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
106	Katalog CODE_Kern_R_M_Korrektur Add to Reading List Source URL: 90.146.8.18 Language: English - Date: 2003-08-29 11:05:15 Computer programming Cross-platform software Software bug Software Complexity Algorithm C PL/I Atari BASIC Computing Software engineering Procedural programming languages
107	informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X \| EISSN \|xx\|0000\|0xxx Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-09-10 09:13:15 Operations research Submodular set function Computational complexity theory Linear programming Randomized rounding Continuous function Optimization problem Mathematical optimization Time complexity Theoretical computer science Mathematics Applied mathematics
108	Some Complexities in Computer-Based Systems and Their Implications for System Development Michael Jackson 101 Hamilton Terrace London NW8 9QX + Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2002-05-03 12:56:50 Object-oriented programming Application programming interfaces Abstraction Data management X Window System Class Complexity Function Computational complexity theory Software engineering Computing Software
109	The Parameterized Complexity of Global Constraints∗ C. Bessiere LIRMM Montpellier, France Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:28 Computer programming Local consistency Constraint satisfaction Constraint logic programming Parameterized complexity Mathematical optimization Clique problem Decomposition method Complexity of constraint satisfaction Constraint programming Theoretical computer science Software engineering
110	Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenĳ Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:11 Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming